from math import log
x,y=map(int,input().split())
n1=log(x)/x
n2=log(y)/y
if(n1==n2):
print("=")
elif(n1<n2):
print("<")
else:
print(">")
#include <bits/stdc++.h>
#define ll long long//:)
#define ld long double//:)
#define yes cout<<"YES"<<endl;//:)
#define no cout<<"NO"<<endl;//:)
#define gcd(a,b) __gcd(a,b);//:)
#define F first//:)
#define S second//:)
#define str string//:)
#define dbl double//:)
#define READ freopen("input.txt", "r", stdin);//:)
#define WRITE freopen("output.txt", "w", stdout);//:)
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);//:)
using namespace std;
bool comp(pair<string,int>a, pair <string,int>b){
if(a.S!=b.S)return(a.S>b.S);
return(a.F<b.F);}
//map <int,string> s //ключ,значение
//vector <pair<int,int>> a(n);
//void solve(){
string ab(ll n){
ll ans=0;
string g="";
while(n>0){
g=char((n%10)+48)+g;
n/=10;}
return g;
}
int main(){
ll n,m;
cin>>n>>m;
if(n==2&&m==4){cout<<"=";return 0;}
if(n==4&&m==2){cout<<"=";return 0;}
if(n==3&&m==2){cout<<">";return 0;}
if(n==2&&m==3){cout<<"<";return 0;}
if(n==1&&m!=1){cout<<"<";return 0;}
if(m==1&&n!=1){cout<<">";return 0;}
if(n>m){cout<<"<";return 0;}
if(n<m){cout<<">";return 0;}
if(n==m){cout<<"=";return 0;}
}
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |
124. Binary Tree Maximum Path Sum | 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
501A - Contest | 160A- Twins |
752. Open the Lock | 1535A - Fair Playoff |
1538F - Interesting Function | 1920. Build Array from Permutation |
494. Target Sum | 797. All Paths From Source to Target |
1547B - Alphabetical Strings | 1550A - Find The Array |
118B - Present from Lena | 27A - Next Test |
785. Is Graph Bipartite | 90. Subsets II |
1560A - Dislike of Threes | 36. Valid Sudoku |
557. Reverse Words in a String III | 566. Reshape the Matrix |
167. Two Sum II - Input array is sorted | 387. First Unique Character in a String |